The fast Gauss transform with complex parameters q
نویسندگان
چکیده
We construct a fast method, OðN logNÞ, for the computation of discrete Gauss transforms with complex parameters, capable of dealing with unequally spaced grid points. The method is based on Fourier techniques, and in particular it makes use of a modified unequally spaced fast Fourier transform algorithm, in combination with previously suggested divide and conquer strategies for ordinary fast Gauss transform methods. 2004 Elsevier Inc. All rights reserved.
منابع مشابه
Fast Gauss transforms with complex parameters using NFFTs
at the target knots yj ∈ [−14 , 1 4 ], j = 1, . . . ,M , where σ = a + ib, a > 0, b ∈ R denotes a complex parameter. Fast Gauss transforms for real parameters σ were developed, e.g., in [15, 8, 9]. In [12], we have specified a more general fast summation algorithm for the Gaussian kernel. Recently, a fast Gauss transform for complex parameters σ with arithmetic complexity O(N log N + M) was int...
متن کاملThe Fast Generalized Gauss Transform
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by quadrature issues that arise in using integral equation methods for solving the heat equation on moving domains. In particular, robust high-order product integration methods require convolution with O(q) distinct Gaus...
متن کاملThe Chebyshev fast Gauss and nonuniform fast Fourier transforms and their application to the evaluation of distributed heat potentials
We present a method for the fast and accurate computation of distributed (or volume) heat potentials in two dimensions. The distributed source is assumed to be given in terms of piecewise space-time Chebyshev polynomials. We discretize uniformly in time, whereas in space the polynomials are defined on the leaf nodes of a quadtree data structure. The quadtree can vary at each time step. We combi...
متن کاملThe fast Gauss transform with all the proofs
In this report we discuss some technical aspects of the fast Gauss transform (FGT). The FGT is a special case of the single level FMM for the Gaussian potential. We give detailed derivation of the correct error bounds which is rather terse in the original paper. We also briefly discuss about the data structures to implement the space subdivision in higher dimensional spaces. [ FGT ]: April 8, 2006
متن کاملApplication of the Fast Gauss Transform to Option Pricing
In many of the numerical methods for pricing American options based on the dynamic programming approach, the most computationally intensive part can be formulated as the summation of Gaussians. Though this operation usually requires O NN ′ work when there are N ′ summations to compute and the number of terms appearing in each summation is N , we can reduce the amount of work to O N +N ′ by usin...
متن کامل